perm filename ABTR[206,JMC] blob sn#730912 filedate 1984-12-13 generic text, type C, neo UTF8
COMMENT ⊗   VALID 00002 PAGES
C REC  PAGE   DESCRIPTION
C00001 00001
C00002 00002
C00004 ENDMK
C⊗;

		A Formal Treatment Of Ignorance

Abstract :


We augment well known decidable variants of (Propositional) Modal
Logics of Knowledge with a validity operator V, where Vp means that 
p is valid. The next step involves an attempt to define what we may
claim to know, based on a fixed knowledge base S. An interesting
case is that we can conclude ¬Kp whenever we fail to prove Kp. In
particular, we argue for assuming the axiom ¬Kp ⊃ K¬Kp whenever 
Kp ⊃ KKp is assumed. Should time allow, we shall remark on the 
Unexpected Examination (Hangman's) Paradox, presenting a new approach
to discribing how to avoid the real world's "refuting logic".
This talk will consist of a presentation of research in progress.